Ramsey numbers in octahedron graphs
نویسندگان
چکیده
منابع مشابه
Ramsey numbers of degenerate graphs
A graph is d-degenerate if all its subgraphs have a vertex of degree at most d. We prove that there exists a constant c such that for all natural numbers d and r, every d-degenerate graph G of chromatic number r has Ramsey number at most 2 cr |V (G)|. This solves a conjecture of Burr and Erdős from 1973.
متن کاملConstrained Ramsey numbers of graphs
Given two graphs G and H, let f (G,H) denote the minimum integer n such that in every coloring of the edges of Kn, there is either a copy of G with all edges having the same color or a copy of H with all edges having different colors. We show that f (G,H) is finite iff G is a star or H is acyclic. If S and T are trees with s and t edges, respectively, we show that 1þ s (t 2)/2 f (S,T ) (s 1)(t ...
متن کاملDegree Ramsey Numbers of Graphs
Let H s → G mean that every s-coloring of E(H) produces a monochromatic copy of G in some color class. Let the s-color degree Ramsey number of a graph G, written R∆(G; s), be min{∆(H) : H s → G}. If T is a tree in which one vertex has degree at most k and all others have degree at most ⌈k/2⌉, then R∆(T ; s) = s(k− 1) + ǫ, where ǫ = 1 when k is odd and ǫ = 0 when k is even. For general trees, R∆...
متن کاملRamsey numbers of ordered graphs
An ordered graph G< is a graph G with vertices ordered by the linear ordering <. The ordered Ramsey number R(G<, c) is the minimum number N such that every ordered complete graph with c-colored edges and at least N vertices contains a monochromatic copy of G<. For unordered graphs it is known that Ramsey numbers of graphs with degrees bounded by a constant are linear with respect to the number ...
متن کاملAnti-Ramsey numbers in complete split graphs
A subgraph of an edge-coloured graph is rainbow if all of its edges have different colours. For graphs G and H the anti-Ramsey number ar(G,H) is the maximum number of colours in an edge-colouring of G with no rainbow copy of H. The notion was introduced by Erdős, Simonovits and V. Sós and studied in case G = Kn. Afterwards exact values or bounds for anti-Ramsey numbers ar(Kn, H) were establishe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00320-4